<HTML><HEAD><TITLE>nodes_to_nodenames(+Graph, +Nodes, -NodeNames)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>nodes_to_nodenames(+Graph, +Nodes, -NodeNames)</H1>
Returns the names corresponding to a list of nodes
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>Nodes</EM></DT>
<DD>a list of integer node numbers
</DD>
<DT><EM>NodeNames</EM></DT>
<DD>a list of ground data, usually node names
</DD>
</DL>
<H2>Description</H2>
<P>
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>nodes_to_nodenames(+, +, -) is semidet
</UL>
<H3>Fail Conditions</H3>
Fails if no node name information is available
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/node_to_nodename-3.html">node_to_nodename / 3</A>, <A HREF="../../lib/graph_algorithms/nodename_to_node-3.html">nodename_to_node / 3</A>, <A HREF="../../lib/graph_algorithms/nodenames_to_nodes-3.html">nodenames_to_nodes / 3</A>
</BODY></HTML>
